Reconstructing signaling pathways using regular language constrained paths

Reconstructing Signaling Pathways from High Throughput Data

Reconstructing Signaling Pathways from High Throughput Data

UniALT for Regular Language Constrained Shortest Paths on a Multi-Modal Transportation Network

Shortest paths on road networks can be efficiently calculated using Dijkstra’s algorithm (D). In addition to roads, multi-modal transportation networks include public transportation, bicycle lanes, etc. For paths on this type of network, further constraints, e.g., preferences in using certain modes of transportation, may arise. The regular language constrained shortest path problem deals with t...

Regular Language Constrained Sequence Alignment Revisited

Imposing constraints in the form of a finite automaton or a regular expression is an effective way to incorporate additional a priori knowledge into sequence alignment procedures. With this motivation, the Regular Expression Constrained Sequence Alignment Problem was introduced, which proposed an O(n²t⁴) time and O(n²t²) space algorithm for solving it, where n is the length of the input strings...

Constrained paths in the flip-graph of regular triangulations

We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the connectivity of the flip-graph of regular triangulations that share the same vertex set. © 2006 Elsevier B.V. All rights reserved.

Reconstructing edge-disjoint paths